Linear Transformation of Pictures Represented by Quad Trees ’
نویسنده
چکیده
An algorithm is described for transforming a quad tree encoding for a picture into a quad tree for the same picture after application of a general linear operator. The technique relies on algorithms and data structures described previously for the construction and superposition of quad trees. The transformation algorithm is shown to take time O(n + sp + mp), where n is the number of nodes in the input tree, s is a scale factor, p is the total perimeter of all the regions of the original picture, m is the number of regions, and p is a resolution parameter.
منابع مشابه
Presentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem
The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...
متن کاملQuad-trees: A Data Structure for Storing Pareto-sets in Multi-objective Evolutionary Algorithms with Elitism
In multi-objective evolutionary algorithms (MOEAs) with elitism, the data structures for storing and updating archives may have a great impact on the required computational (CPU) time, especially when optimizing higherdimensional problems with large Pareto-sets. In this chapter, we introduce Quad-trees as an alternative data structure to linear lists for storing Paretosets. In particular, we in...
متن کاملImage Compression Method Based on QR-Wavelet Transformation
In this paper, a procedure is reported that discuss how linear algebra can be used in image compression. The basic idea is that each image can be represented as a matrix. We apply linear algebra (QR factorization and wavelet transformation algorithms) on this matrix and get a reduced matrix out such that the image corresponding to this reduced matrix requires much less storage space than th...
متن کاملComparison of Data Structures for Storing Pareto-sets in MOEAs
In MOEAs with elitism, the data structures and algorithms for storing and updating archives may have a great impact on the CPU time, especially when optimizing continuous problems with larger population sizes. In this paper, we introduce Quad-trees as an efficient data structure for storing Pareto-points. Apart from conventional linear lists, we have implemented three kinds of Quad-trees for th...
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کامل